Geometric Random Inner Product Test and Randomness of Π
نویسنده
چکیده
The Geometric Random Inner Product (GRIP) is a recently developed test method for randomness. As a relatively new method, its properties, weaknesses, and strengths are not well documented. In this paper, we provide a rigorous discussion of what the GRIP test measures, and point out specific classes of defects that it is able to diagnose. Our findings show that the GRIP test successfully detects series that have regularities in their firstor second-order differences, such as the Weyl and nested Weyl sequences. We compare and contrast the GRIP test to some of the existing conventional methods and show that it is particularly successful in diagnosing deficient random number generators with bad lattice structures and short periods. We also present an application of the GRIP test to the decimal digits of π.
منابع مشابه
Bertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random
The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...
متن کاملRandom Closed Sets
We investigate notions of randomness in the space C[2] of nonempty closed subsets of {0, 1}. A probability measure is given and a version of the Martin-Löf Test for randomness is defined. Π 2 random closed sets exist but there are no random Π 1 closed sets. It is shown that a random closed set is perfect, has measure 0, and has no computable elements. A closed subset of 2 may be defined as the ...
متن کاملA Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملExtractors for Turing-Machine Sources
We obtain the first deterministic randomness extractors for n-bit sources with minentropy ≥ n1−α generated (or sampled) by single-tape Turing machines running in time n2−16α, for all sufficiently small α > 0. We also show that such machines cannot sample a uniform n-bit input to the Inner Product function together with the output. The proofs combine a variant of the crossing-sequence technique ...
متن کاملHigher Kurtz randomness
A real x is ∆1-Kurtz random (Π 1 1-Kurtz random) if it is in no closed null ∆1 set (Π 1 1 set). We show that there is a cone of Π 1 1-Kurtz random hyperdegrees. We characterize lowness for ∆1-Kurtz randomness as being ∆ 1 1-dominated and ∆ 1 1semi-traceable.
متن کامل